Factorization theorems for relatively prime divisor sums, GCD sums and generalized Ramanujan sums
نویسندگان
چکیده
منابع مشابه
Ramanujan Sums as Supercharacters
The theory of supercharacters, recently developed by DiaconisIsaacs and André, can be used to derive the fundamental algebraic properties of Ramanujan sums. This machinery frequently yields one-line proofs of difficult identities and provides many novel formulas. In addition to exhibiting a new application of supercharacter theory, this article also serves as a blueprint for future work since s...
متن کاملLegendre Ramanujan Sums transform
In this paper, Legendre Ramanujan Sums transform(LRST) is proposed and derived by applying DFT to the complete generalized Legendre sequence (CGLS) matrices. The original matrix based Ramanujan Sums transform (RST) by truncating the Ramanujan Sums series is nonorthogonal and lack of fast algorithm, the proposed LRST has orthogonal property and O(Nlog2N) complexity fast algorithm. The LRST trans...
متن کاملRestricted Divisor Sums
where the function f(n) is n, n or n + n + p+1 4 , where p ≡ 3 mod 4 is a rational prime, and where dα(n) = #{d : d|n and 1 ≤ d ≤ α} for real α ≥ 1. Motivation for considering these sums comes from an expression which is derived for the class number of a quadratic field with discriminant −p, in terms of a certain restricted divisor sum. This sum is currently too difficult to estimate, in that t...
متن کاملRamanujan sums via generalized Möbius functions and applications
A generalized Ramanujan sum (GRS) is defined by replacing the usual Möbius function in the classical Ramanujan sum with the Souriau-Hsu-Möbius function. After collecting basic properties of a GRS, mostly containing existing ones, seven aspects of a GRS are studied. The first shows that the unique representation of even functions with respect to GRSs is possible. The second is a derivation of th...
متن کاملComputing prime harmonic sums
We discuss a method for computing ∑ p≤x 1/p, using time about x2/3 and space about x1/3. It is based on the Meissel-Lehmer algorithm for computing the prime-counting function π(x), which was adapted and improved by Lagarias, Miller, and Odlyzko. We used this algorithm to determine the first point at which the prime harmonic sum first crosses 4.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Ramanujan Journal
سال: 2020
ISSN: 1382-4090,1572-9303
DOI: 10.1007/s11139-020-00323-5